Largest parallelotopes contained in simplices
نویسندگان
چکیده
منابع مشابه
Large regular simplices contained in a hypercube
We prove that the n-dimensional unit hypercube contains an n-dimensional regular simplex of edge length c √ n, where c > 0 is a constant independent of n. Let l∆n be the n-dimensional regular simplex of edge length l, and let lQn be the n-dimensional hypercube of edge length l. For simplicity, we omit l if l= 1, e.g., Qn denotes the unit hypercube. We are interested in the maximum edge length o...
متن کاملLargest digraphs contained in all n-tournaments
A directed graph G is an unavoidable subgraph o f all n-tournaments or, simply n-unavoidable, if every tournament on n vertices contain san isomorphic copy o f G, i.e., for each ntournament T there exists an edge preserving injection o f the vertices o f G into the vertices o f T. The problem o f showing certain types o f graphs to be n-unavoidable has been the subject o f several papers, for e...
متن کاملOn largest volume simplices and sub-determinants
We show that the problem of finding the simplex of largest volume in the convex hull of n points in Q can be approximated with a factor of O(log d) in polynomial time. This improves upon the previously best known approximation guarantee of d(d−1)/2 by Khachiyan. On the other hand, we show that there exists a constant c > 1 such that this problem cannot be approximated with a factor of c, unless...
متن کاملLARGEST j-SIMPLICES IN d-CUBES: SOME RELATIVES OF THE HADAMARD MAXIMUM DETERMINANT PROBLEM
This paper studies the computationally diicult problem of nding a largest j-dimensional simplex in a given d-dimensional cube. The case in which j = d is of special interest, for it is equivalent to the Hadamard maximum determinant problem; it has been solved for innnitely many values of d but not for d = 14. (The subcase in which j = d 3 (mod 4) subsumes the famous problem on the existence of ...
متن کاملThe Abstract Domain of Parallelotopes
We propose a numerical abstract domain based on parallelotopes. A parallelotope is a polyhedron whose constraint matrix is squared and invertible. The domain of parallelotopes is a fully relational abstraction of the Cousot and Halbwachs’ polyhedra abstract domain, and does not use templates. We equip the domain of parallelotopes with all the necessary operations for the analysis of imperative ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00138-7